0 N ov 1 99 9 A new combinatorial characterization of the minimal cardinality of a subset of R which is not of first category

نویسنده

  • Apoloniusz Tyszka
چکیده

Let M denote the ideal of first category subsets of R. We prove that min{card X : X ⊆ R,X 6∈ M} is the smallest cardinality of a family S ⊆ {0, 1} with the property that for each f : ω −→ ⋃ n∈ω{0, 1} n there exists a sequence {an}n∈ω belonging to S such that for infinitely many i ∈ ω the infinite sequence {ai+n}n∈ω extends the finite sequence f(i). We inform that S ⊆ {0, 1} is not of first category if and only if for each f : ω −→ ⋃ n∈ω{0, 1} n there exists a sequence {an}n∈ω belonging to S such that for infinitely many i ∈ ω the infinite sequence {ai+n}n∈ω extends the finite sequence f(i). LetM denote the ideal of first category subsets ofR. LetM({0, 1}) denote the ideal of first category subsets of the Cantor space {0, 1}. Obviously: (∗) non(M) : = min{card X : X ⊆ R, X 6∈ M} = min{card X : X ⊆ {0, 1}, X 6∈ M({0, 1})} Let ∀ abbreviate ”for all except finitely many”. It is known (see [1], [2] and also [3]) that: non(M) = min{card F : F ⊆ ω and ¬ ∃g ∈ ω ∀f ∈ F ∀k g(k) 6= f(k)} Mathematics Subject Classification 2000. Primary: 03E05, 54A25; Secondary: 26A03.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

5 S ep 1 99 9 On the minimal cardinality of a subset of R which is not of first category

Let M be the ideal of first category subsets ofR and non(M) = min{card X : X ⊆ R,X 6∈ M}. We consider families Φ of sequences converging to∞, with the property that for every open set U ⊆ R that is unbounded above there exists a sequence belonging to Φ, which has an infinite number of terms belonging to U . We present assumptions about Φ which imply that the minimal cardinality of Φ equals non(...

متن کامل

All Ramsey (2K2,C4)−Minimal Graphs

Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...

متن کامل

Vertex Decomposable Simplicial Complexes Associated to Path Graphs

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

متن کامل

The Basic Theorem and its Consequences

Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...

متن کامل

2 6 A ug 1 99 9 On the minimal cardinality of a subset of R which is not of first category

Let M be the ideal of first category subsets of R and non(M) = min{card X : X ⊆ R,X 6∈ M}. We consider families Φ of sequences converging to∞, with the property that for every open set U ⊆ R that is unbounded above there exists a sequence belonging to Φ, which has an infinite number of terms belonging to U . We present assumptions about Φ which imply that the minimal cardinality of Φ equals non...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999